The Optimization of Chordal Ring Networks
نویسنده
چکیده
This paper deals with the design of multi-(micro)computer interconnection networks modelled by graphs. In particular we concentrate upon the optimization of a new family of such networks that turn out to be a generalization of the well-known Arden and Lee's chordal ring networks. This optimization problem leads to the search for certain 3-regular graphs with minimumdiameter for a given order and/or maximum order for a given diameter. The use of a geometrical approach based on plane tessellations facilitates the solution of the problem.
منابع مشابه
Periodically Regular Chordal Rings
ÐChordal rings have been proposed in the past as networks that combine the simple routing framework of rings with the lower diameter, wider bisection, and higher resilience of other architectures. Virtually all proposed chordal ring networks are nodesymmetric, i.e., all nodes have the same in/out degree and interconnection pattern. Unfortunately, such regular chordal rings are not scalable. In ...
متن کاملInfluence of Wavelength Interchange on the Blocking Performance of Wavelength Routed Chordal Ring Networks
In this paper, we investigate the influence of wavelength interchange on the blocking performance of wavelength routed optical networks with chordal ring topology. We have considered chordal rings with chord lengths of 3, N/4, and N +3, being N the number of nodes. It is shown that chordal ring networks with a chord length of N +3 and mesh-torus networks have a similar behaviour regarding wavel...
متن کاملThe Embedding of Meshes and Trees into Degree Four Chordal Ring Networks
In this paper a particular computer interconnection network, the symmetric chordal ring network of degree four, is presented, and the mapping of meshes and binary trees onto chordal ring networks is analysed. Expressions for the network diameter (the maximum distance a message must travel between any pair of computers) and the mean inter-computer distance are derived for a sub-set of chordal ri...
متن کاملPeriodically Regular Chordal Rings are Preferable to Double-Ring Networks
The susceptibility of ring networks to disconnection as a result of one or two node/link failures has led to a number of proposals to increase the robustness of such networks. One class of proposals, discussed primarily in the networking and communication communities, but also advocated for use in parallel and distributed systems, involves the provision of a second ring to improve system throug...
متن کاملFault-tolerant routings in chordal ring networks
This paper studies routing vulnerability in networks modeled by chordal ring graphs. In a chordal ring graph, the vertices are labeled in Z2n and each even vertex i is adjacent to the vertices i + a, i + b, i + c, where a, b, and c are different odd integers. Our study is based on a geometrical representation that associates to the graph a tile which periodically tessellates the plane. Using th...
متن کامل